Binary tomographic reconstruction
نویسندگان
چکیده
The binary tomographic reconstruction problem consists of finding a binary image from (very) few projections (line sum of pixels) along given directions [1]. An efficient heuristic algorithm is introduced [2]. The first (initialization) step is similar to the traditional “filtered backprojection” algorithm used for standard tomographic reconstructions, but based on a non-linear transform, s = (p) = log(p/(1-p)), of the probability, p, of pixels be 1-valued. A basic binarization produces an initial guess for the reconstructed image. The second step is an iterated correction of the reconstructed image. The difference between the known projection and that computed from the current image estimate is used to adjust the corresponding s values by a constant along each projection ray. Spatial regularization through convolution with a Gaussian is introduced in the second step after each iteration with a progressively smaller and smaller width.
منابع مشابه
A relaxation method for smooth tomographic reconstruction of binary axially symmetric objects
In this paper we study a minimization problem which appears in tomographic reconstruction. The problem is known to be ill posed. The object to reconstruct is assumed to be binary so that the intensity function belongs to {0, 1}. Therefore the feasible set is not convex and its interior is empty for most usual topologies. We propose a relaxed formulation of the problem . We prove existence of so...
متن کاملA variational method using fractional order Hilbert spaces for tomographic reconstruction of blurred and noised binary images
We provide in this article a refined functional analysis of the Radon operator restricted to axisymmetric functions, and show that it enjoys strong regularity properties in fractional order Hilbert spaces. This study is motivated by a problem of tomographic reconstruction of binary axially symmetric objects, for which we have available one single blurred and noised snapshot. We propose a variat...
متن کاملA Convex Programming Algorithm for Noisy Discrete Tomography
A convex programming approach to discrete tomographic image reconstruction in noisy environments is proposed. Conventional constraints are mixed with noise-based constraints on the sinogram and a binarity-promoting total variation constraint. The noise-based constraints are modeled as confidence regions that are constructed under a Poisson noise assumption. A convex objective is then minimized ...
متن کاملAn active curve approach for tomographic reconstruction of binary radially symmetric objects
Abstract. This paper deals with a method of tomographic reconstruction of radially symmetric objects from a single radiograph, in order to study the behavior of shocked material. The usual tomographic reconstruction algorithms such as generalized inverse or filtered back-projection cannot be applied here because data are very noisy and the inverse problem associated to single view tomographic r...
متن کاملDiscrete Tomographic Reconstruction of Binary Images with Disjoint Components Using Shape Information
We present a general framework for reconstructing binary images with disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori knowledge about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we show h...
متن کامل